Square character degree graphs yield direct products
نویسندگان
چکیده
منابع مشابه
Character Degree Graphs That Are Complete Graphs
Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We define Γ(G) to be the graph whose vertex set is cd(G) − {1}, and there is an edge between a and b if (a, b) > 1. We prove that if Γ(G) is a complete graph, then G is a solvable group.
متن کاملDominating direct products of graphs
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with arbitrarily large domination numbers are constructed for which this bound is attained. Concerning the upper domination number we prove that Γ(G × H) ≥ Γ(G)Γ(H), thus confirming a conjecture from [16]. Finally, for paired-domi...
متن کاملList coloring the square of sparse graphs with large degree
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...
متن کاملVertex coloring the square of outerplanar graphs of low degree
Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that the chromatic number of the square of an outerplanar graph of maximum degree ∆ = 6 is 7. The optimal upper bound for the chromatic number of the square of an outerplanar graph of maximum degree ∆ 6= 6 is known. Hence, this mentioned chromatic number of 7 is the last an...
متن کاملEmulating Direct Products by Index-Shuffle Graphs
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degree hypercube-like interconnection network, recently introduced by [ Baumslag and Obrenić (1997): Index-Shuffle Graphs, :::]) efficiently approximates the hypercube in general computations, by emulating the directproduct structure of the hypercube. In the direct product G =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2012
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2011.09.016